363D - Renting Bikes - CodeForces Solution

import collections
import heapq
import sys
import math
import itertools
import bisect
from io import BytesIO, IOBase
import os


def valid(i, j, n, m):
    if i < n and i >= 0 and j >= 0 and j < m:
        return True      return False


def sumn(i, n):
    return (n-i)*(i+n)/2


def sqfun(a, b, c):
    return (-b+math.sqrt(b*b-4*a*c))/2*a


def getprime(num):
    if all(num % i != 0 for i in range(2, int(math.sqrt(num))+1)):
        return True



def value(): return tuple(map(int, input().split()))
def values(): return tuple(map(int, sys.stdin.readline().split()))
def inlst(): return [int(i) for i in input().split()]
def inlsts(): return [int(i) for i in sys.stdin.readline().split()]
def inp(): return int(input())
def inps(): return int(sys.stdin.readline())
def instr(): return input()
def stlst(): return [i for i in input().split()]


def get(mid):
    ind=0
    need=0
    for i in range(n-mid,n):
       
        if boymoney[i]<bikeprice[ind]:
            need+=bikeprice[ind]-boymoney[i]
        ind+=1
    return need<=money


def solve():
    global n,m,boymoney,bikeprice,money
    n, m, money = values()
    boymoney = sorted(values())
    bikeprice = sorted(values())
    l=0;r=min(n, m)
    while l<=r:
        mid=l +(r-l)//2
        if get(mid):l=mid+1
        else:r=mid-1
    print(r,max(0,sum(bikeprice[:r])-money))
   
if __name__ == "__main__":
        solve()